Shortest Path Search with Constraints on Surface Models of in-the-ear Hearing Aids
نویسنده
چکیده
One part of the production of modern hearing aids is the integration of a ventilation tube. This is usually done by applying a shortest path search algorithm on a non-convex ear impression. For the functionality of this so-called vent the path search algorithm has to fulfill several constraints like smoothness and space consumption of the vent. The proposed solution is based upon a modified version of Dijkstra’s algorithm to address the constraints and to increase accuracy. The algorithm was evaluated by experts and validated to perform better for the application than a shortest path solution.
منابع مشابه
The Prevalence of Ear Disease in Sensorineural Hearing Impaired Children Below 18 Years-Old in Deaf Welfare Clinic of Molavi Rehabilitation Center
Objectives: Hearing impairment in children is considered as an important public health problem. Auditory function in these children is poor and depends on their hearing aids efficacy and also their ears’ status. Hearing aids are very expensive and ear disease deteriorates its performance. Therefore detecting the ear disease and offering proper treatment is necessary. The aim of this study is to...
متن کاملCockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach
Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for ...
متن کاملCase Report of Unusual complications after hearing aid fitting that required surgical management
The making of ear mould for hearing aids is generally considered to be a safe process. However, there are a few reported cases of complications caused during mould making. We report the case of a man with 69 years age, where the process of making the mould for a hearing aid led to the perforation of the tympanic membrane and pouring of mould material into the middle ear, necessitating surgical ...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملThe Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint
In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...
متن کامل